/*
 * JBeagle - a Java toolkit for genetic algorithms.
 * 
 * Copyright (c) 2010 Matthijs Snel
 * 
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
package jbeagle.examples;

import jbeagle.core.FitnessFunction;
import jbeagle.core.Population;
import jbeagle.core.ListIndividual;

/**
 * Works on {@code Individual}s that are bit strings; aims to get a string of all 1s.
 * Therefore, fitness is simply the number of 1s in an {@code Individual}.
 * 
 * @author Matthijs Snel
 */
public class OneMaxFitnessFunction implements FitnessFunction<ListIndividual<Integer>, Integer> {
	public void evaluate( ListIndividual<Integer> ind ) {
		int sum = 0;
		for( int i = 0; i < ind.size(); i++ )
			sum += ind.get(i);
		ind.setFitness(sum);
	}
	
	public void evaluate( Population<ListIndividual<Integer>, Integer> pop ) {
		for( ListIndividual<Integer> ind : pop )
			evaluate(ind);
	}
}
